61 research outputs found
Fast Software Polar Decoders
Among error-correcting codes, polar codes are the first to provably achieve
channel capacity with an explicit construction. In this work, we present
software implementations of a polar decoder that leverage the capabilities of
modern general-purpose processors to achieve an information throughput in
excess of 200 Mbps, a throughput well suited for software-defined-radio
applications. We also show that, for a similar error-correction performance,
the throughput of polar decoders both surpasses that of LDPC decoders targeting
general-purpose processors and is competitive with that of state-of-the-art
software LDPC decoders running on graphic processing units.Comment: 5 pages, 3 figures, submitted to ICASSP 201
Multi-User Multi-Carrier Differential Chaos Shift Keying Communication System
In this paper, a multi user Multi-Carrier Differential Chaos Shift Keying
(MC-DCSK) modulation is presented. The system endeavors to provide a good
trade-off between robustness, energy efficiency and high data rate, while still
being simple. In this architecture of MC-DCSK system, for each user, chaotic
reference sequence is transmitted over a predefined subcarrier frequency.
Multiple modulated data streams are transmitted over the remaining subcarriers
allocated for each user. This transmitter structure saves energy and increases
the spectral efficiency of the conventional DCSK system.Comment: Accepted in the IEEE International Wireless Communications and Mobile
Computing Conference (IWCMC 2013
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes
In this work, we present hardware and software implementations of flexible
polar systematic encoders and decoders. The proposed implementations operate on
polar codes of any length less than a maximum and of any rate. We describe the
low-complexity, highly parallel, and flexible systematic-encoding algorithm
that we use and prove its correctness. Our hardware implementation results show
that the overhead of adding code rate and length flexibility is little, and the
impact on operation latency minor compared to code-specific versions. Finally,
the flexible software encoder and decoder implementations are also shown to be
able to maintain high throughput and low latency.Comment: Submitted to IEEE Transactions on Communications, 201
Partitioned Successive-Cancellation List Decoding of Polar Codes
Successive-cancellation list (SCL) decoding is an algorithm that provides
very good error-correction performance for polar codes. However, its hardware
implementation requires a large amount of memory, mainly to store intermediate
results. In this paper, a partitioned SCL algorithm is proposed to reduce the
large memory requirements of the conventional SCL algorithm. The decoder tree
is broken into partitions that are decoded separately. We show that with
careful selection of list sizes and number of partitions, the proposed
algorithm can outperform conventional SCL while requiring less memory.Comment: 4 pages, 6 figures, to appear at IEEE ICASSP 201
- …